Improved Big-M reformulation for generalized disjunctive programs
نویسندگان
چکیده
In this work, we present a new Big-M reformulation for Generalized Disjunctive Programs. The proposed MINLP reformulation is stronger than the traditional Big-M, and it does not require additional variables or constraints. We present the new Big-M, and analyze the strength in its continuous relaxation compared to that of the traditional Big-M. The new formulation is tested by solving several instances of process networks and muli-product batch plant problems with an NLP-based branch and bound method. The results show that, in most cases, the new reformulation requires fewer nodes and less time to find the optimal solution.
منابع مشابه
Algorithmic Approach for Improved Mixed-Integer Reformulations of Convex Generalized Disjunctive Programs
In this work, we propose an algorithmic approach to improve mixed-integer models that are originally formulated as convex Generalized Disjunctive Programs (GDP). The algorithm seeks to obtain an improved continuous relaxation of the MILP/MINLP reformulation of the GDP, while limiting the growth in the problem size. There are three main stages that form the basis of the algorithm. The first one ...
متن کاملImproved Formulations and Computational Strategies for the Solution and Nonconvex Generalized Disjunctive Programs
Many optimization problems require the modelling of discrete and continuous variables, giving rise to mixed-integer linear and mixed-integer nonlinear programming (MILP / MINLP). An alternative representation of MINLP is Generalized Disjunctive Programming (GDP)1. GDP models are represented through continuous and Boolean variables, and involve algebraic equations, disjunctions, and logic propos...
متن کاملCutting Plane Algorithm for Convex Generalized Disjunctive Programs
Authors are encouraged to submit new papers to INFORMS journals by means of a style file template, which includes the journal title. However, use of a template does not certify that the paper has been accepted for publication in the named journal. INFORMS journal templates are for the exclusive purpose of submitting to an INFORMS journal and should not be used to distribute the papers in print ...
متن کاملGeneralized Disjunctive Programming as a Systematic Modeling Framework to Derive Scheduling Formulations
We propose generalized disjunctive programming models for the short-term scheduling problem of single stage batch plants with parallel units. Three different concepts of continuous-time representation are explored, immediate and general precedence, as well as multiple time grids. The GDP models are then reformulated using both big-M and convex hull reformulations, and the resulting mixed-intege...
متن کاملLagrangean relaxation of the hull-reformulation of linear generalized disjunctive programs and its use in disjunctive branch and bound
In this work, we present a Lagrangean relaxation of the hull-reformulation of discrete-continuous optimization problems formulated as linear generalized disjunctive programs (GDP). The proposed Lagrangean relaxation has three important properties. The first property is that it can be applied to any linear GDP. The second property is that the solution to its continuous relaxation always yields 0...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Computers & Chemical Engineering
دوره 76 شماره
صفحات -
تاریخ انتشار 2015